FFTc: An MLIR Dialect for Developing HPC Fast Fourier Transform Libraries
نویسندگان
چکیده
Discrete Fourier Transform (DFT) libraries are one of the most critical software components for scientific computing. Inspired by FFTW, a widely used library DFT HPC calculations, we apply compiler technologies development transform libraries. In this work, introduce FFTc, domain-specific language, based on Multi-Level Intermediate Representation (MLIR), expressing algorithms. We present initial design, implementation, and preliminary results FFTc.
منابع مشابه
FFTC: Fastest Fourier Transform for the IBM Cell Broadband Engine
The Sony-Toshiba-IBM Cell Broadband Engine is a heterogeneous multicore chip architectured for intensive gaming applications and high performance computing. It consists of a traditional microprocessor (called the PPE) that controls eight SIMD co-processing units called synergistic processor elements (SPEs). We exploit the architectural features of the Cell processor to design an efficient paral...
متن کاملAn Equivariant Fast Fourier Transform Algorithm
This paper presents a generalization of the Cooley-Tukey fast Fourier transform algorithm that respects group symmetries. The algorithm, when applied to a function invariant under a group of symmetries, fully exploits these symmetries to reduce both the number of arithmetic operations and the amount of memory used. The symmetries accommodated by the algorithm include all of the crystallographic...
متن کاملInteger fast Fourier transform
In this paper, a concept of integer fast Fourier transform (IntFFT) for approximating the discrete Fourier transform is introduced. Unlike the fixed-point fast Fourier transform (FxpFFT), the new transform has the properties that it is an integer-to-integer mapping, is power adaptable and is reversible. The lifting scheme is used to approximate complex multiplications appearing in the FFT latti...
متن کاملPipeline Fast Fourier Transform
This paper describes a novel structure for a hardwired fast Fourier transform (FFT) signal processor that promises to permit digital spectrum analysis to achieve throughput rates consistent with extremely wide-band radars. The technique is based on the use of serial storage for data and intermediate results and multiple arithmetic units each of which carries out a sparse Fourier transform. Deta...
متن کاملCoreFFT Fast Fourier Transform
• Forward and Inverse 32-, 64-, 128-, 256-, 512-, 1,024-, and 2,048-Point Complex FFT • Decimation–In-Time (DIT) Radix-2 Implementation Optimized for Actel FPGAs • Selection of Unconditional or Conditional Block Floating-Point Scaling • Embedded RAM-Block-Based Twiddle Factor Generator • 8to 16-Bit Configurable Input/Output Data and Twiddle Coefficients Precision • Naturally Ordered Input and O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-31209-0_6